Grothendieck-Type Inequalities in Combinatorial Optimization
نویسندگان
چکیده
منابع مشابه
Grothendieck-type inequalities in combinatorial optimization
We survey connections of the Grothendieck inequality and its variants to combinatorial optimization and computational complexity.
متن کاملCombinatorial Formulae for Grothendieck-demazure and Grothendieck Polynomials
∂if = f− sif xi − xi+1 where si acts on f by transposing xi and xi+1 and let π̃i = ∂i(xi(1− xi+1)f) Then the Grothendieck-Demazure polynomial κα, which is attributed to A. Lascoux and M. P. Schützenberger, is defined as κα = x α1 1 x α2 2 x α3 3 ... if α1 ≥ α2 ≥ α3 ≥ ..., i.e. α is non-increasing, and κα = π̃iκαsi if αi < αi+1, where si acts on α by transposing the indices. Example 2.1. Let α = (...
متن کاملComputation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization
This is a survey of a recent methodology to solve systems of polynomial equations and inequalities for problems arising in combinatorial optimization. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear algebra or semidefinite programming relaxations of many kinds of feasibility or optimization questions.
متن کاملA Combinatorial Version of the Grothendieck Conjecture
We study the “combinatorial anabelian geometry” that governs the relationship between the dual semi-graph of a pointed stable curve and various associated profinite fundamental groups of the pointed stable curve. Although many results of this type have been obtained previously in various particular situations of interest under unnecessarily strong hypotheses, the goal of the present paper is to...
متن کاملConsidering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications on Pure and Applied Mathematics
سال: 2012
ISSN: 0010-3640
DOI: 10.1002/cpa.21398